Maximum Entropy/Optimal Projection (MEOP) control design synthesis: Optimal quantification of the major design tradeoffs

The underlying philosophy and motivation of the optimal projection/maximum entropy (OP/ME) stochastic modeling and reduced control design methodology for high order systems with parameter uncertainties are discussed. The OP/ME design equations for reduced-order dynamic compensation including the effect of parameter uncertainties are reviewed. The application of the methodology to several Large Space Structures (LSS) problems of representative complexity is illustrated

Implementation of robust image artifact removal in SWarp through clipped mean stacking

We implement an algorithm for detecting and removing artifacts from astronomical images by means of outlier rejection during stacking. Our method is capable of addressing both small, highly significant artifacts such as cosmic rays and, by applying a filtering technique to generate single frame masks, larger area but lower surface brightness features such as secondary (ghost) images of bright stars. In contrast to the common method of building a median stack, the clipped or outlier-filtered mean stacked point-spread function (PSF) is a linear combination of the single frame PSFs as long as the latter are moderately homogeneous, a property of great importance for weak lensing shape measurement or model fitting photometry. In addition, it has superior noise properties, allowing a significant reduction in exposure time compared to median stacking. We make publicly available a modified version of SWarp that implements clipped mean stacking and software to generate single frame masks from the list of outlier pixels.Comment: PASP accepted; software for download at http://www.usm.uni-muenchen.de/~dgruen

Reconstructing the direction of reactor antineutrinos via electron scattering in Gd-doped water Cherenkov detectors

The potential of elastic antineutrino-electron scattering in a Gd-doped water Cherenkov detector to determine the direction of a nuclear reactor antineutrino flux was investigated using the recently proposed WATCHMAN antineutrino experiment as a baseline model. The expected scattering rate was determined assuming a 13-km standoff from a 3.758-GWt light water nuclear reactor and the detector response was modeled using a Geant4-based simulation package. Background was estimated via independent simulations and by scaling published measurements from similar detectors. Background contributions were estimated for solar neutrinos, misidentified reactor-based inverse beta decay interactions, cosmogenic radionuclides, water-borne radon, and gamma rays from the photomultiplier tubes (PMTs), detector walls, and surrounding rock. We show that with the use of low background PMTs and sufficient fiducialization, water-borne radon and cosmogenic radionuclides pose the largest threats to sensitivity. Directional sensitivity was then analyzed as a function of radon contamination, detector depth, and detector size. The results provide a list of experimental conditions that, if satisfied in practice, would enable antineutrino directional reconstruction at 3$\sigma$ significance in large Gd-doped water Cherenkov detectors with greater than 10-km standoff from a nuclear reactor.Comment: 11 pages, 9 figure

Maximum entropy controller synthesis for colocated and noncolocated systems

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/77185/1/AIAA-21277-539.pd

Slice Stretching Effects for Maximal Slicing of a Schwarzschild Black Hole

Slice stretching effects such as slice sucking and slice wrapping arise when foliating the extended Schwarzschild spacetime with maximal slices. For arbitrary spatial coordinates these effects can be quantified in the context of boundary conditions where the lapse arises as a linear combination of odd and even lapse. Favorable boundary conditions are then derived which make the overall slice stretching occur late in numerical simulations. Allowing the lapse to become negative, this requirement leads to lapse functions which approach at late times the odd lapse corresponding to the static Schwarzschild metric. Demanding in addition that a numerically favorable lapse remains non-negative, as result the average of odd and even lapse is obtained. At late times the lapse with zero gradient at the puncture arising for the puncture evolution is precisely of this form. Finally, analytic arguments are given on how slice stretching effects can be avoided. Here the excision technique and the working mechanism of the shift function are studied in detail.Comment: 16 pages, 4 figures, revised version including a study on how slice stretching can be avoided by using excision and/or shift

Dynamic autonomous intelligent control of an asteroid lander

One of the future flagship missions of the European Space Agency (ESA) is the asteroid sample return mission Marco-Polo. Although there have been a number of past missions to asteroids, a sample has never been successfully returned. The return of asteroid regolith to the Earth's surface introduces new technical challenges. This paper develops attitude control algorithms for the descent phase onto an asteroid in micro-gravity conditions and draws a comparison between the algorithms considered. Two studies are also performed regarding the Fault Detection Isolation and Recovery (FDIR) of the control laws considered. The potential of using Direct Adaptive Control (DAC) as a controller for the surface sampling process is also investigated. Use of a DAC controller incorporates increased levels of robustness by allowing realtime variation of control gains. This leads to better response to uncertainties encountered during missions

Real structured singular value synthesis using the scaled Popov criterion

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/77238/1/AIAA-21537-608.pd

On the role of entanglement in quantum computational speed-up

For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed-up over classical computation. Furthermore we prove that the algorithm can be classically efficiently simulated to within a prescribed tolerance \eta even if a suitably small amount of global entanglement (depending on \eta) is present. We explicitly identify the occurrence of increasing multi-partite entanglement in Shor's algorithm. Our results do not apply to quantum algorithms operating on mixed states in general and we discuss the suggestion that an exponential computational speed-up might be possible with mixed states in the total absence of entanglement. Finally, despite the essential role of entanglement for pure state algorithms, we argue that it is nevertheless misleading to view entanglement as a key resource for quantum computational power.Comment: Main proofs simplified. A few further explanatory remarks added. 22 pages, plain late

HardIDX: Practical and Secure Index with SGX

Software-based approaches for search over encrypted data are still either challenged by lack of proper, low-leakage encryption or slow performance. Existing hardware-based approaches do not scale well due to hardware limitations and software designs that are not specifically tailored to the hardware architecture, and are rarely well analyzed for their security (e.g., the impact of side channels). Additionally, existing hardware-based solutions often have a large code footprint in the trusted environment susceptible to software compromises. In this paper we present HardIDX: a hardware-based approach, leveraging Intel's SGX, for search over encrypted data. It implements only the security critical core, i.e., the search functionality, in the trusted environment and resorts to untrusted software for the remainder. HardIDX is deployable as a highly performant encrypted database index: it is logarithmic in the size of the index and searches are performed within a few milliseconds rather than seconds. We formally model and prove the security of our scheme showing that its leakage is equivalent to the best known searchable encryption schemes. Our implementation has a very small code and memory footprint yet still scales to virtually unlimited search index sizes, i.e., size is limited only by the general - non-secure - hardware resources